Multivariate versions of Cochran's theorems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On linear versions of some addition theorems

Let K ⊂ L be a field extension. Given K-subspaces A,B of L, we study the subspace 〈AB〉 spanned by the product set AB = {ab | a ∈ A, b ∈ B}. We obtain some lower bounds on dimK〈AB〉 and dimK〈B 〉 in terms of dimK A, dimK B and n. This is achieved by establishing linear versions of constructions and results in additive number theory mainly due to Kemperman and Olson.

متن کامل

On Complemented Versions of James’s Distortion Theorems

Examples are given to show that two natural questions asked in [5] about complemented versions of James’s distortion theorems have negative answers.

متن کامل

Constructive Versions of Tarskγs Fixed Point Theorems

Let F be a monotone operator on the complete lattice L into itself. Tarski's lattice theoretical fixed point theorem states that the set of fixed points of F is a nonempty complete lattice for the ordering of L. We give a constructive proof of this theorem showing that the set of fixed points of F is the image of L by a lower and an upper preclosure operator. These preclosure operators are the ...

متن کامل

On quantitative versions of theorems due to

This paper is another case study in the program of logically analyzing proofs to extract new (typically effective) information (‘proof mining’). We extract explicit uniform rates of metastability (in the sense of T. Tao) from two ineffective proofs of a classical theorem of F.E. Browder on the convergence of approximants to fixed points of nonexpansive mappings as well as from a proof of a theo...

متن کامل

Parallel Multivariate Meta-Theorems

Fixed-parameter tractability is based on the observation that many hard problems become tractable even on large inputs as long as certain input parameters are small. Originally, “tractable” just meant “solvable in polynomial time,” but especially modern hardware raises the question of whether we can also achieve “solvable in polylogarithmic parallel time.” A framework for this study of parallel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Multivariate Analysis

سال: 1991

ISSN: 0047-259X

DOI: 10.1016/0047-259x(91)90011-p